Efficient universal hashing method

ABSTRACT

An efficient hashing technique uses 
                 w   2     +   w     2         
operations to hash a string “w” words long rather than the w 2  operations of the prior art. This efficiency is achieved by squaring the sum of the key and the string to be hashed rather than forming a product of the key and the string to be hashed
   h ( m )=(( m+a ) 2  mod  p )mod 2 1 .

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to data manipulation; more specifically, the invention relates to an efficient technique for representing long strings of data as shorter strings of data.

2. Description of the Related Art

Hashing is a technique for representing longer lengths of data as shorter lengths of data. The techniques are such that there is a relatively small probability that two different longer lengths of data will be represented as identical short lengths of data. The feature is called a probability of collision.

$\begin{matrix} \begin{matrix} {{\Pr\left( {{h\left( m_{1} \right)} = {h\left( m_{2} \right)}} \right)}\underset{\_}{<}ɛ} \\ {ɛ\underset{\_}{>}\frac{1}{2^{\prime}}} \end{matrix} & (1) \end{matrix}$

The probability of collision is represented by Equation (1) which indicates that the probability of a hashing function “h” performed on a string m₁ being equal to the result of a hashing function “h” performed on a string m₂ being less than or equal to

$\frac{1}{2^{\prime}}\mspace{14mu}{or}\mspace{14mu}{ɛ.}$

The number of bits contained in the longer unhashed string is “n”. The number of bits in the shorter or hashed string is “l”. A hashing function that satisfies Equation (1) is often referred to as ε universal.

$\begin{matrix} \begin{matrix} {{\Pr\left( {{h\left( m_{1} \right)} = {{h\left( m_{2} \right)} = \Delta}} \right)}\underset{\_}{<}ɛ} \\ {ɛ\underset{\_}{>}\frac{1}{2^{\prime}}} \end{matrix} & (2) \end{matrix}$

Another property typically associated with hashing functions is represented by Equation (2) where it indicates that the probability of the difference between the output of a hashing function “h” on string x₁ and the output of a hashing function on string x₂ being equal to some preselected number Δ is less than or equal to

$\frac{1}{2^{\prime}}$ or ε. Hashing functions that satisfy Equation (2) are typically referred to as εΔ universal hash functions.

$\begin{matrix} \begin{matrix} {{\Pr\left( {{{h\left( m_{1} \right)} = c_{1}},{{h\left( m_{2} \right)} = c_{2}}} \right)}\underset{\_}{<}\frac{ɛ}{2^{\prime}}} \\ {ɛ\underset{\_}{>}\frac{1}{2^{\prime}}} \end{matrix} & (3) \end{matrix}$

Some hash functions also have a third property illustrated by Equation (3). Equation (3) shows that the joint probability of the output of hashing function “h” for input string x₁ being equal to a predetermined number c₁ and the output of hashing function “h” for input string x₂ being equal to predetermined number c₂ is less than

$\frac{1}{2^{\prime}}$ or ε. A hashing function that satisfies Equation (3) is referred to as ε strongly universal. Hashing functions that satisfy Equation (3) automatically satisfy Equations (1) and (2).

Hashing functions are used in many applications, one of which is to simplify searching for text strings. When used for searching for text strings, the hashing function is used to reduce the size of the stored information and then the same hashing function is used to reduce the size of the search criteria. The shortened search criteria is then used to search for the shortened stored information to more efficiently locate a desired piece of information. Once the desired piece of information has been located, the unhashed or full length text associated with the shorted text can be provided.

Hashing functions are also used in wireless communications for message authentication. A message is authenticated by sending a message string along with a tag, calculated by performing a cryptographic function on the message. Forming a tag of a message string is computationally intensive. Hash functions are used to shorten the message to a tag so that the cryptographic processing required is less intense. h(m)=(ma) mod p  (4)

$\begin{matrix} {{h\left( {m_{1},\ldots\mspace{14mu},m_{k}} \right)} = {\left( {\sum\limits_{i = 1}^{K}\;{m_{i}a_{i}}} \right){mod}\; p}} & (5) \end{matrix}$

Techniques such as linear hashing illustrated by Equation (4) and MMH hashing illustrated by Equation (5) are now used to represent longer strings of data or text as shorter strings where the probability of two different long strings producing the same short string is relatively small. These hashing functions require a multiplication of a key that is “w” words long by a “w” words long message or text that is to be hashed. As a result, w² operations are required to perform a hashing of a particular string of data or text. For large strings of data or text having many words, this results in a computationally intensive operation.

SUMMARY OF THE INVENTION

The present invention provides an efficient hashing technique that uses

$\frac{w^{2} + w}{2}.$ operations to hash a string “w” words long rather than the w² operations of the prior art. The present invention achieves this efficiency by squaring the sum of the key and the string to be hashed rather than forming a product of the key and the string to be hashed. h(m)=((m+a)² mod p)mod 2^(l)  (6)

In one embodiment of the invention, as illustrated by Equation (6), a hashing of a message “m” is performed by summing the message string with a key string “a” and then forming the square of that summation. A modular “p” operation performed on the result of the squaring operation and a modular 2^(l) operation is performed on the result of the modular “p” operation. In this case, both “m” and “a” are of the same length, that is, “n” bits or “w” words long. It should be noted that “a” may be longer than “n” bits, but “n” bits is preferable. The value “l” refers to the length in bits of the shortened string that results from the hashing. The value “p” is selected as the first prime number greater than 2^(n) where “n” is the number of bits in the message string “m”. It should be noted that Equation (6) provides a hashing method that satisfies Equations (1) and (2), that is, the hashing method of Equation is Δ universal. h(m)=(((m+a)² +b)mod p)mod2^(l)  (7)

In the second embodiment of the present invention, a strongly universal hashing method is provided. In this case, message string “m” is summed with key “a” and then the resulting sum is squared. Both message string “m” and key “a” are “w” words long containing a total of “n” bits. It should be noted that key “a” may contain more than “n” bits, but “n” is preferable. The result of the squaring operation is then summed with a second key “b” which is at least “n” bits long. A modular “p” operation is performed on the sum of the squared term and key “b” as discussed above with regard to Equation (6). A modular 2^(l) operation is performed on the result of the modular “p” operations as was described with regard to Equation (6). Using this hashing method provides a strongly universal hashing method that satisfies Equation (1), (2) and (3).

In yet another embodiment of the present invention, “k” messages or strings are hashed so that a single shorter string is produced.

$\begin{matrix} {{h\left( {m_{1},\ldots\mspace{14mu},m_{k}} \right)} = {\left( {\left( {\sum\limits_{i = 1}^{K}\;\left( {m_{i} + a_{i}} \right)^{2}} \right){mod}\; p} \right){{mod}2}^{\prime}}} & (8) \end{matrix}$

Equation (8) illustrates the hashing function where “k” messages, each of which is “w” words long are hashed to form a single shorter string. Each message m_(i) is summed with a key a_(i) and the resulting sum is squared. The result of the squaring operation for each message m_(i) is then summed over the “k” messages. A modular “p” operation is performed on the overall sum, and a modular 2^(l) operation is performed on the result of the modular “p” operation. The values “p” and “l” are once again defined as described above. The hashing method illustrated by Equation (8) produces a Δ universal hashing function that satisfies Equations (1) and (2).

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 is a flowchart of a square hashing method;

FIG. 2 is a flowchart of a strongly universal square hashing method; and

FIG. 3 is a flowchart of a second Δ universal square hashing method.

DETAILED DESCRIPTION

FIG. 1 illustrates a method for carrying out the square hashing method of Equation (6). In step 100 an input string or message “m” is inputted. In step 102 an input key “a” is inputted. The message or string “m” and the key “a” are each “n” bits long consisting of “w” words. Key “a” is a random or pseudo-random number and may be longer than “n” bits, but “n” bits is preferable. In step 104 the sum “s” of string “m” and key “a” is formed. In step 106 sum “s” is squared. In step 108 a modular “p” operation is formed on the result of step 106. “p” is the next prime number larger than 2^(n); however, “p” may be a larger prime which may degrade performance. In step 110 a modular 2^(l) operation is performed on the result of step 108. “l” is the number of bits in the short output message or string. In step 112 the result of the modular 2^(l) operation is outputted. The process of FIG. 1 results in a message or string of “n” bits being reduced to a message or string of “l” bits. It should be noted that the process associated with FIG. 1 executes an εΔ universal hash function that satisfies the properties of Equations (1) and (2).

FIG. 2 illustrates a method for carrying out the strongly universal hashing method described by Equation (7). In step 140 a message or string “m” is inputted. In step 142 keys “a” and “b” are inputted. Message “m”, key “a” and key “b” are each “n” bits long having “w” words. In step 144 the sum of message “m” and key “a” is formed and stored as sum “s”. In step 146 the square of sum “s” is stored as term “SQ”. In step 148 the sum of the term “SQ” and key “b” is formed. In step 150 a modular “p” operation is performed on the result produced by step 148. Once again, “p” is equal to the next prime number greater than 2^(n); however, “p” may be a larger prime which may degrade performance. In step 152 a modular 2^(l) operation is performed on the result from step 150. “l” is equal to the number of bits in the string or message to be outputted by this method. In step 154 the short message or string of length “l” is outputted. It should be noted that the method of FIG. 2 reduced a string or message of “n” bits to a string or message of “l” bits. It should also be noted that the process of FIG. 2 is an ε strongly universal hash function that satisfies the properties of Equations (1), (2) and (3).

FIG. 3 illustrates a method for performing the εΔ universal hashing method described by Equation (8). In step 170 index “i” is set equal to 1 and the variable SUM is set equal to 0. In step 172 the value of “k” is inputted. “k” is equal to the number of strings or messages that will be inputted to produce a single shortened message. In step 174 message or string m_(i) is separated, and in step 176 input key a_(i) is inputted. It should be noted that message or string m_(i) and input key a_(i) are of equal length and have “n” bits composing “w” words. Key “a_(i)” is a random or pseudo-random number and may be longer than “n” bits, but “n” bits is preferable. Preferably, a_(i) is a random number. Random numbers can be generated from many sources such as pseudo-random generators. In step 178 sum s_(i) is formed by forming the sum of message m_(i) and key a_(i). In step 180 the square of s_(i) is set equal to variable SQ_(i). In step 182 the variable SUM is set equal to the variable SUM plus SQ_(i). In step 184 the value of “i” is checked to determine if it is equal to the value “k”. If it is not equal to the value “k”, step 186 is executed where the value of index “i” is incremented by “l” and then step 174 is executed. If in step 184 the value of “i” is determined to be equal to “k”, step 188 is executed where a modular “p” operation is performed on the current value of the variable SUM. As discussed previously, the value “p” is the next prime number greater than the value 2^(n); however, “p” may be a larger prime which may degrade performance. In step 190 a modular 2^(l) operation is performed on the results produced in step 188. Once again, “l” is the number of bits composing the output string or message. In step 192 the shortened message or string of “l” bits is outputted. It should be noted that the process of FIG. 3 reduced “k” messages of “n” bits each to one message of “l” bits. It should also be noted that the hashing method of FIG. 3 is a εΔ universal hashing method that satisfies the properties of Equations (1) and (2).

In reference to FIGS. 1, 2 and 3, it should be noted that the value “l” is typically chosen based on a trade-off between desiring a short output message of length “l” and the desire to minimize the probabilities of Equations (1) and (2) and in the case of an ε strongly universal hash function, Equation (3).

The following section provides an abbreviated proof showing that the disclosed squaring hash functions satisfies the properties for Equations (1), (2) and (3).

Theorem 1: The hashing function described by Equation (6) is Δ—universal.

Proof: For all m≠nεZ_(p), and ΔεZ_(p): P _(x) r[h _(x)(m)−h _(x)(n)=Δ]  (1) =P _(x) r[(m+x)²−(n+x)²=Δ]  (2) =P _(x) r[(m ² −n ²+2(m−n)x=Δ]  (3) =1/p  (4) Where the last inequality follows since for any given m≠nεZ_(p) and δεZ_(p) there is a unique x which satisfies the equation m²−n²+2(m−n)x=δ. Theorem 2: The hashing function described by Equation (7) is a strongly universal family of hash functions. Proof: Follows as an immediate corollary of the following lemma which shows how to convert any Δ—universal family of hash functions into a strongly—universal family of hash functions. Lemma 1: Let “h”={h_(x): D→R|xεK}, where R is an abelian group and “k” is the set of keys, be a Δ—universal family of hash functions. Then H′={h′_(x,b): D→R|xεK,bεR} defined by h′_(x,b) (m)≡(h_(x) (m)+b) (where the addition is the operation under the group R) is a strongly universal family of hash functions. Proof: For all m≠nεD and all α, βεR:

$\begin{matrix} {\Pr\limits_{x,b}\left\lbrack {{{{h^{\prime}}_{x,b}(m)} = \alpha},{{{h^{\prime}}_{x,b}(n)} = \beta}} \right.} & (5) \\ {= {\Pr\limits_{x,b}\left\lbrack {{{{h_{x}(m)} + b} = \alpha},{{{h_{x}(n)} + b} = \beta}} \right\rbrack}} & (6) \\ {= {\Pr\limits_{x,b}\left\lbrack {{{{h_{x}(m)} - {h_{x}(n)}} = {\alpha - \beta}},{b = {\alpha - {h_{x}(m)}}}} \right\rbrack}} & (7) \\ {= {\Pr\limits_{x,b}\left\{ {{{h_{x}(m)} - {h_{x}(n)}} = {{{\alpha - \beta}❘b} = {\alpha - {h_{x}(m)}}}} \right\rbrack{\Pr\limits_{x,b}\left\lbrack {b = {\alpha - {h_{x}(m)}}} \right\rbrack}}} & (8) \end{matrix}$ =1/|R| ²  (9)

The last equation follows since h_(x) is a Δ—universal hash function and h_(x)(m)−h_(x)(n) can take on any value in R with equal probability. 

1. A method for producing a shortened representation of a collection of bits, comprising the steps of: inputting the collection of “n” bits; summing a key having at least “n” bits with the collection of bits to produce a sum; squaring the sum to produce a squared sum; performing a modular “p” operation on the squared sum, where “p” is at least as large as a first prime number greater than 2^(n) to produce a modular “p” result; performing a modular 2^(l) operation on the modular “p” result to produce a modular 2^(l) result where, “l” is less than “n”; and outputting the modular 2^(l) result.
 2. A method for producing a shortened representation of a collection of bits, comprising the steps of: inputting the collection of “n” bits; summing a first key having at least “n” bits with the collection of bits to produce a first sum; squaring the first sum to produce a squared sum; summing the squared sum with a second key having at least “n” bits to produce a second sum; performing a modular “p” operation on the second sum, where “p” is at least as large as a first prime number greater than 2^(n) to produce a modular “p” result; performing a modular 2^(l) operation on the modular “p” result to produce a modular 2^(l) result where, “l” is less than “n”; and outputting the modular 2^(l) result.
 3. A method for producing a shortened representation of a collection of bits, comprising the steps of: inputting a collection of “n” bits; summing a key having at least “n” bits with the collection of bits to produce a sum; squaring the sum to produce a squared sum; repeating the previous three steps at least once to produce a plurality of squared sums, where a different key is used each time the steps are repeated; summing the plurality of squared sums to produce a summation; performing a modular “p” operation on the summation, where “p” is at least as large as a first prime number greater than 2^(n) to produce a modular “p” result; performing a modular 2^(l) operation on the modular “p” result to produce a modular 2^(l) result where, “l” is less than “n”; and outputting the modular 2^(l) result. 